On codes having no finite completions
نویسندگان
چکیده
منابع مشابه
On Codes having Dual Distance d'>=k
Keywords: Linear codes MDS-codes AMS Subject classiication (1985) 94B05 Summary: We give several bounds for the length, dimension or minimum distance of linear block codes whose dimension equals the minimum distance of their dual codes. Zusammenfassung: Wir geben verschiedene Schranken f ur die L ange, die Dimension und den Minimalabstand linearer Blockcodes, deren Dimension gleich dem Mini-mal...
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملOn Infinitary Finite Length Codes
For a code CcX* the following four conditions are considered: (i) for ail words u, v, in X* and for every word w in C*, wu, uv, vu in C* imply u, v in C*. (ii) every onesided infinité product of words of C is unambiguous. (Ui) C has flnite decoding delay. (iv) C has bounded decoding delay. lt is shown that in gênerai (iv) —> (Ui) —• (ii) -* (ï), and the reverse implications are not true; wherea...
متن کاملOn Shortened Finite Geometry Codes
The class of finite geometry codes [Rudolph (1964, 1967), Weldon (1967, 1968), Goethals and Delsarte (1968), Peterson and Weldon (1972)] consisting of Euclidean geometry codes and projective geometry codes forms a class of multiple-error-correcting codes that are majority-logic decodable. Being majority-logic decodable codes, finite geometry codes can be simply implemented with high speed. The ...
متن کاملRow-finite Equivalents Exists Only for Graphs Having No Uncountable Emitters
If E is a not-necessarily row-finite graph, such that each vertex of E emits at most countably many edges, then a desingularization F of E can be constructed as described in [3] or [7]. The desingularization process has been effectively used to establish various characteristics of the Leavitt path algebras of not-necessarily row-finite graphs. Such a desingularization F of E has the properties ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1977
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90164-9